Mass-balanced randomization of metabolic networks
نویسندگان
چکیده
منابع مشابه
Mass-balanced randomization of metabolic networks
MOTIVATION Network-centered studies in systems biology attempt to integrate the topological properties of biological networks with experimental data in order to make predictions and posit hypotheses. For any topology-based prediction, it is necessary to first assess the significance of the analyzed property in a biologically meaningful context. Therefore, devising network null models, carefully...
متن کاملJMassBalance: mass-balanced randomization and analysis of metabolic networks
SUMMARY Analysis of biological networks requires assessing the statistical significance of network-based predictions by using a realistic null model. However, the existing network null model, switch randomization, is unsuitable for metabolic networks, as it does not include physical constraints and generates unrealistic reactions. We present JMassBalance, a tool for mass-balanced randomization ...
متن کاملHierarchical load-balanced routing via bounded randomization
The purpose of routing protocols in a computer network is to maximize network throughput. Popular shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. That is, the shortest path between a source and a destination may become highly congested even when many other paths have low utilization. In this paper, we propose a routing scheme for hi...
متن کاملLoad-Balanced Routing via Bounded Randomization
Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. That is, the shortest path between a source and a destination may become highly congested even when many other paths have low utilization. We propose a routing scheme that distributes traffic over the whole network via boun...
متن کاملPerformance Evaluation of Load-Balanced Routing via Bounded Randomization
Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols such as OSPF and RIP have the disadvantage of causing bottlenecks due to their inherent single-path routing. That is, the uniformly selected shortest path between a source and a destination may become highly congested even when many other paths have low utilization. We propose a family of routing sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2011
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btr145